Almost Sure Asymptotic Optimality in Online Machine Scheduling
نویسندگان
چکیده
In this paper, we analyze well-known online algorithms for the following problems: 1|rj , pmtn| ∑ j wjCj , 1|rj | ∑ j wjCj , Q|rj , pmtn| ∑ j Cj and P |rj | ∑ j Cj . We consider the Weighted Shortest Processing Requirement (WSPR) heuristic, its non-preemptive version (NWSPR), the Shortest Remaining Processing Requirement on Fastest Machine (SRPR-FM) heuristic, and the Shortest Processing Requirement (SPR) heuristic, respectively. By introducing very general probabilistic assumptions on the problem data we can show that these online algorithms are almost surely asymptotically optimal; the probabilistic assumptions are not known nor utilized by the online algorithms.
منابع مشابه
Almost sure asymptotic optimality for online routing and machine scheduling problems
In this paper we study algorithms for online routing and machine scheduling problems. The problems are “online” because the problem instances are revealed incrementally. We first study algorithms for the online Traveling Repairman Problem (TRP), where a single server is to visit a set of locations in a network with the objective of minimizing the sum of weighted completion times. We then analyz...
متن کاملAlmost Sure Asymptotic Optimality for the Online Traveling Repairman Problem with Precedence Constraints
In this paper we study online algorithms for the online Traveling Repairman Problem (TRP) with precedence constraints. We show that, under general stochastic structures for the problem data, unknown and unused by the online algorithm, many online algorithms for this problem are almost surely asymptotically optimal. We also provide computational results for special cases that show that the conve...
متن کاملOnline Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006